#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<stack>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n,u,v;cin>>n>>u>>v;
    set<LL>s;
    for(LL i=1;i<=n;i++){
        cin>>a[i];
        s.insert(a[i]);
    }
    if(s.size()==1){
        cout<<min(u+v,2*v)<<"\n";
        continue;
    }
    else{
        bool flag=1;
        for(LL i=n;i>1;i--){
            if(abs(a[i]-a[i-1])>=2){
                flag=0;
            }
        }
        if(flag==0){
            cout<<"0"<<"\n";
            continue;
        }
        bool f=1;
        for(LL i=1;i<n;i++){
            if(abs(a[i]-a[i+1])==1){
                f=0;
            }
        }
        if(f==0){
            cout<<min(u,v)<<"\n";

        }
    }
  }
return 0;
}
